Embeddings of Simple Maximum Packings of triples with 2 Even
نویسندگان
چکیده
Let MPT (v, 2) denote a maximum packing of triples of order v and index 2. An MPT (v, 2) is called simple if it contains no repeated triples. It is proved in this paper that for v > 2 and any even 2, the necessary and sufficient condition for the embedding of a simple MPT(v,2) in a simple MPT(u,).) is u >/2v + 1.
منابع مشابه
Two Doyen-Wilson theorems for maximum packings with triples
In this paper we complete the work begun by Mendelsohn and Rosa and by Hartman, finding necessary and sufficient conditions for a maximum packing with triples of order m MPT(m) to be embedded in an MPT(n). We also characterize when it is possible to embed an MPT(m) with leave LI in an MPT(n) with leave L2 in such a way that L1 C L2.
متن کاملOn Biembedding an Idempotent Latin Square with Its Transpose
Let L be an idempotent Latin square of side n, thought of as a set of ordered triples (i, j, k) where L(i, j) = k. Let I be the set of triples (i, i, i). We consider the problem of biembedding the triples of L \ I with the triples of L′ \ I, where L′ is the transpose of L, in an orientable surface. We construct such embeddings for all doubly even values of n.
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملPackings and coverings of v=3m+1 points with near-triangle factors
We determine, for each v == 1 mod 3, the maximum (resp. minimum) number of near-triangle factors possible on v points so that each pair of distinct points occurs in a triple in at most (resp. at least) one of the neartriangle factors. In particular, we show that for each v == 1 mod 3, v:/: 7, there exists a near-resolvable exact 2-covering of v points by triples whose near-triangle factors admi...
متن کاملJointly Embedding Knowledge Graphs and Logical Rules
Embedding knowledge graphs into continuous vector spaces has recently attracted increasing interest. Most existing methods perform the embedding task using only fact triples. Logical rules, although containing rich background information, have not been well studied in this task. This paper proposes a novel method of jointly embedding knowledge graphs and logical rules. The key idea is to repres...
متن کامل